- method of generalized coordinates
- метод обобщенных координат
Авиасловарь. М.А.Левин. 2004.
Авиасловарь. М.А.Левин. 2004.
Generalized coordinates — By deriving equations of motion in terms of a general set of generalized coordinates, the results found will be valid for any coordinate system that is ultimately specified. cite book |last=Torby |first=Bruce |title=Advanced Dynamics for… … Wikipedia
Action-angle coordinates — In classical mechanics, action angle coordinates are a set of canonical coordinates useful in solving many integrable systems. The method of action angles is useful for obtaining the frequencies of oscillatory or rotational motion without solving … Wikipedia
GF method — Wilson s GF method, sometimes referred to as FG method, is a classical mechanical method to obtain certain internal coordinates fora vibrating semi rigid molecule, the so called normal coordinates Q k. Normal coordinates decouple the classical… … Wikipedia
Born coordinates — / ) are time like curves with fixed R .In relativistic physics, the Born coordinate chart is a coordinate chart for (part of) Minkowski spacetime, the flat spacetime of special relativity. It is often used to analyze the physical experience of… … Wikipedia
Durand–Kerner method — In numerical analysis, the Durand–Kerner method established 1960–66 and named after E. Durand and Immo Kerner, also called the method of Weierstrass, established 1859–91 and named after Karl Weierstrass, is a root finding algorithm for… … Wikipedia
Information bottleneck method — The information bottleneck method is a technique introduced by Tishby et al [1] for finding the best tradeoff between accuracy and complexity (compression) when summarizing (e.g. clustering) a random variable X, given a joint probability… … Wikipedia
Schwarzschild coordinates — In the theory of Lorentzian manifolds, spherically symmetric spacetimes admit a family of nested round spheres . In such a spacetime, a particularly important kind of coordinate chart is the Schwarzschild chart, a kind of polar spherical… … Wikipedia
Lucas–Kanade method — In computer vision, the Lucas–Kanade method is a two frame differential method for optical flow estimation developed by Bruce D. Lucas and Takeo KanadeOptical flow algorithms estimate the deformations between two image frames. The basic… … Wikipedia
mechanics — /meuh kan iks/, n. 1. (used with a sing. v.) the branch of physics that deals with the action of forces on bodies and with motion, comprised of kinetics, statics, and kinematics. 2. (used with a sing. v.) the theoretical and practical application … Universalium
Constraint algorithm — In mechanics, a constraint algorithm is a method for satisfying constraints for bodies that obey Newton s equations of motion. There are three basic approaches to satisfying such constraints: choosing novel unconstrained coordinates ( internal… … Wikipedia
List of mathematics articles (G) — NOTOC G G₂ G delta space G networks Gδ set G structure G test G127 G2 manifold G2 structure Gabor atom Gabor filter Gabor transform Gabor Wigner transform Gabow s algorithm Gabriel graph Gabriel s Horn Gain graph Gain group Galerkin method… … Wikipedia